翻訳と辞書
Words near each other
・ Cyclic prefix
・ Cyclic pump
・ Cyclic pyranopterin monophosphate
・ Cyclic pyranopterin monophosphate synthase
・ Cyclic quadrilateral
・ Cyclic reduction
・ Cyclic redundancy check
・ Cycle basis
・ Cycle button
・ Cycle chic
・ Cycle Collstrop
・ Cycle Computing
・ Cycle count
・ Cycle cover
・ Cycle decomposition
Cycle decomposition (graph theory)
・ Cycle detection
・ Cycle double cover
・ Cycle for Declamation
・ Cycle for Survival
・ Cycle Force Group
・ Cycle Friendly Awards
・ Cycle Gear
・ Cycle Glacier
・ Cycle graph
・ Cycle graph (algebra)
・ Cycle index
・ Cycle Messenger World Championships
・ Cycle News
・ Cycle of abuse


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Cycle decomposition (graph theory) : ウィキペディア英語版
Cycle decomposition (graph theory)

In graph theory, a cycle decomposition is a decomposition (a partitioning of a graph's edges) into cycles. Every vertex in a graph that has a cycle decomposition must have even degree.
==Cycle decomposition of K_n and K_n-I==

Brian Alspach and Heather Gavlas established necessary and sufficient conditions for the existence of a decomposition of a complete graph of even order minus a 1-factor into even cycles and a complete graph of odd order into odd cycles.〔(Science Direct Article )〕 Their proof relies on Cayley graphs, in particular, circulant graphs, and many of their decompositions come from the action of a permutation on a fixed subgraph.
They proved that for positive even integers m and n with 4\leq m\leq n ,the graph K_n-I (where I is a 1-factor) can be decomposed into cycles of length m if and only if the number of edges in K_n-I is a multiple of m. Also, for positive odd integers m and n with 3≤m≤n, the graph K_n can be decomposed into cycles of length m if and only if the number of edges in K_n is a multiple of m.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Cycle decomposition (graph theory)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.